Path-oriented random testing through iterative partitioning (IP-PRT)

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Adaptive Random Testing Through Iterative Partitioning

Random Testing (RT) is an important and fundamental approach to testing computer software. Adaptive Random Testing (ART) has been proposed to improve the faultdetection capability of RT. ART employs the location information of successful test cases (those that have been executed but not revealed a failure) to enforce an even spread of random test cases across the input domain. Distance-based AR...

متن کامل

Restricted Adaptive Random Testing by Random Partitioning

Adaptive Random Testing (ART) is designed to detect the first failure with fewer test cases than pure Random Testing. Since well-known ART methods, namely Distance-Based ART (D-ART) and Restriction-Based ART (RRT), have quadratic runtime, ART methods based on the idea of partitioning have been presented. ART by Random Partitioning is one of these partition-based ART algorithms. While having onl...

متن کامل

Shortest Path through Random Points

Let (M, g1) be a compact d-dimensional Riemannian manifold. Let Xn be a set of n sample points in M drawn randomly from a Lebesgue density f . Define two points x, y ∈ M . We prove that the normalized length of the power-weighted shortest path between x, y passing through Xn converges to the Riemannian distance between x, y under the metric gp = f g1, where p > 1 is the power parameter. The res...

متن کامل

A Path-oriented Automatic Random Testing Based on Double Constraint Propagation

A key issue in software testing is the actual generation of test data from program input domain. Obviously, more accurate input domain is, more efficient test generation is. This paper presents a path-oriented automatic random testing method based on double constraint propagation. For a given path, its domain can be reduced by splitting an input variable domain and executing a double constraint...

متن کامل

Adaptive Random Testing Through Dynamic Partitioning By Localization with Distance and Enlarged Input Domain

1 Abstract—Based on the intuition that evenly distributed test cases have more chance for revealing non-point pattern failure regions, various Adaptive Random Testing (ART) methods have been proposed. A large portion of this methods such as ART with random partitioning by localization have edge preference problem. This problem would decrease the performance of these methods. In this article the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES

سال: 2019

ISSN: 1303-6203

DOI: 10.3906/elk-1801-18